Efficient-Scheduling Parallel Multiplier-Based Ring-LWE Cryptoprocessors
نویسندگان
چکیده
منابع مشابه
Efficient Multi-Query CPIR from Ring-LWE
We propose an (n,m)-computationally-private information retrieval (CPIR) protocol with rate 1 − o(1) and highly nontrivial (sublinear and data-dependent) server’s computational complexity. For this, we note that an (n,m)-CPIR protocol is equivalent to a secure function evaluation protocol that evaluates a secret function f on m different inputs. Thus, we first design an efficient multi-level ci...
متن کاملA Family of Scalable Polynomial Multiplier Architectures for Ring-LWE Based Cryptosystems
Many lattice based cryptosystems are based on the Ring learning with errors (Ring-LWE) problem. The most critical and computationally intensive operation of these Ring-LWE based cryptosystems is polynomial multiplication over rings. In this paper, we exploit the number theoretic transform (NTT) to build a family of scalable polynomial multiplier architectures, which provide designers with a tra...
متن کاملOn error distributions in ring-based LWE
Since its introduction in 2010 by Lyubashevsky, Peikert and Regev, the ring learning with errors problem (ring-LWE) has become a popular building block for cryptographic primitives, due to its great versatility and its hardness proof consisting of a (quantum) reduction from ideal lattice problems. But, for a given modulus q and degree n number field K, generating ring-LWE samples can be perceiv...
متن کاملLarge Modulus Ring-LWE ≥ Module-LWE
We present a reduction from the module learning with errors problem (MLWE) in dimension d and with modulus q to the ring learning with errors problem (RLWE) with modulus q. Our reduction increases the LWE error rate α by a quadratic factor in the ring dimension n and a square root in the module rank d for power-of-two cyclotomics. Since, on the other hand, MLWE is at least as hard as RLWE, we c...
متن کاملChallenges for Ring-LWE
As lattice cryptography becomes more widely used in practice, there is an increasing need for further cryptanalytic effort and higher-confidence security estimates for its underlying computational problems. Of particular interest is a class of problems used in many recent implementations, namely, Learning With Errors (LWE), its more efficient ring-based variant Ring-LWE, and their “deterministi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronics
سال: 2019
ISSN: 2079-9292
DOI: 10.3390/electronics8040413